Analytical force constant calculation as a minimization problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analytical Solution to the Constant Modulus Factorization Problem

Iterative constant modulus algorithms have been used to blindly separate and retrieve interfering constant modulus signals impinging on an antenna array. These algorithms have several well-known but basically unsolved deficiencies. In this paper, we present an algorithm to analytically compute the solution to the underlying constant modulus (CM) factorization problem. With this new approach, it...

متن کامل

Calculation of a constant Q spectral transform

The frequencies that have been chosen to make up the scale of Western music are geometrically spaced. Thus the discrete Fourier transform (DFT), although extremely effcient in the fast Fourier transform implementation, yields components which do not map efficiently to musical frequencies. This is because the frequency components calculated with the DFT are separated by a constant frequency diff...

متن کامل

Analytical Minimization of Half - Perimeter

Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16]. Placement quality is evaluated in terms of the half-perimeter wirelength (HPWL) of hyperedges in the original circuit hypergraph provided timing constraints are met. Analytical placers are instrumental in handling non-linear timing models 9, 3], but have two important drawbacks: (a) cor...

متن کامل

Fast calculation of inverse square root with the use of magic constant - analytical approach

We present a mathematical analysis of transformations used in fast calculation of inverse square root for single-precision floating-point numbers. Optimal values of the so called magic constants are derived in a systematic way, minimizing either absolute or relative errors at subsequent stages of the discussed algorithm.

متن کامل

An analytical constant modulus algorithm

Iterative constant modulus algorithms such as Godard and CMA have been used to blindly separate a superposition of co-channel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima and the retrieval of all individual CM signals that are present in the channel. In this paper, we show that the underlyin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Quantum Chemistry

سال: 1986

ISSN: 0020-7608,1097-461X

DOI: 10.1002/qua.560300513